package puzzle.projecteuler.p100;

import astudy.util.AdvMath;

public class Problem073 {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		int c = 0;
		for (int d = 1; d <= 10000; d ++) {
			for (int n = 1; n < d; n ++) {
				if ((2*n < d) && (3*n > d) && AdvMath.gcd(n,d) == 1) {
					c ++;
				}
			}
		}
		System.out.println(c);
	}

}
